- non-self-intersecting
- Математика: самонепересекающийся
Универсальный англо-русский словарь. Академик.ру. 2011.
non-self-intersecting
Смотреть что такое "non-self-intersecting" в других словарях:
Polygon — For other uses, see Polygon (disambiguation). Some polygons of different kinds In geometry a polygon ( … Wikipedia
Space-filling curve — 3 iterations of a Peano curve construction, whose limit is a space filling curve. In mathematical analysis, a space filling curve is a curve whose range contains the entire 2 dimensional unit square (or more generally an N dimensional hypercube) … Wikipedia
Rectangle — Family Orthotope Type Quadrilateral Edges and vertices 4 Schläfli symbol {}x{} … Wikipedia
Meander (mathematics) — In mathematics, a meander or closed meander is a self avoiding closed curve which intersects a line a number of times. Intuitively, a meander can be viewed as a road crossing a river through a number of bridges. Contents 1 Meander 1.1 Examples… … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the … Wikipedia
Fourth dimension — [ tesseract rotating around a plane in 4D.] In physics and mathematics, a sequence of n numbers can be understood as a location in an n dimensional space. When n =4, the set of all such locations is called 4 dimensional space, or, colloquially,… … Wikipedia
Flexible polyhedron — In geometry, a flexible polyhedron is a polyhedral surface that allows continuous non rigid deformations such that all faces remain rigid. The Cauchy rigidity theorem shows that in dimension 3 such a polyhedron cannot be convex (this is also … Wikipedia
Jordan curve theorem — Illustration of the Jordan curve theorem. The Jordan curve (drawn in black) divides the plane into an inside region (light blue) and an outside region (pink). In topology, a Jordan curve is a non self intersecting continuous loop in the plane.… … Wikipedia
Polygonal modeling — In 3D computer graphics, polygonal modeling is an approach for modeling objects by representing or approximating their surfaces using polygons. Polygonal modeling is well suited to scanline rendering and is therefore the method of choice for real … Wikipedia
Carpenter's ruler problem — The carpenter s ruler problem is a discrete geometry problem, which can be stated in the following manner: Can a simple planar polygon be moved continuously to a position where all its vertices are in convex position, so that the edge lengths and … Wikipedia
